Approximate Intrinsic Voxel Structure for Point Cloud Simplification

نویسندگان

چکیده

A point cloud as an information-intensive 3D representation usually requires a large amount of transmission, storage and computing resources, which seriously hinder its usage in many emerging fields. In this paper, we propose novel simplification method, Approximate Intrinsic Voxel Structure (AIVS), to meet the diverse demands real-world application scenarios. The method includes pre-processing (denoising down-sampling), AIVS-based realization for isotropic flexible with intrinsic control distance. To demonstrate effectiveness proposed conducted extensive experiments by comparing it several relevant methods on three public datasets, including Stanford, SHREC, RGB-D scene models. experimental results indicate that AIVS has great advantages over peers terms moving least squares (MLS) surface approximation quality, curvature-sensitive sampling, sharp-feature keeping processing speed. source code is publicly available. ( https://github.com/vvvwo/AIVS-project ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intrinsic point cloud simplification

Modelling and visualisation methods working directly with point-sampled geometry have developed into attractive alternatives to more traditional mesh-based surface processing. In this paper, we consider a vital step in any point-based surface processing pipeline, point cloud simplification. Building upon the intrinsic point cloud simplification idea put forward in [14], we obtain a simplificati...

متن کامل

Error-Controllable Simplification of Point Cloud

Point cloud simplification has become a vital step in any point-based surface processing pipeline. This paper describes a fast and effective algorithm for point cloud simplification with feature preservation. First, feature points are extracted by thresholding curvatures; Second, for non-feature points, they are covered by distinct balls, the points in each ball are substituted by an optimized ...

متن کامل

A new point cloud simplification algorithm

We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-controlled density guarantee. The algorithm is computationally and memory efficient, easy to implement...

متن کامل

Voxel Based Object Simplification

We present a simple, robust, and practical method for object simplification for applications where gradual elimination of high frequency details is desired. This is accomplished by sampling and low-pass filtering the object into multi-resolution volume buffers and applying the marching cubes algorithm to generate a multi-resolution triangle-mesh hierarchy. Our method simplifies the genus of obj...

متن کامل

Point Cloud Simplification and Processing for Path-Planning

Recently the area of motion planning research has been experiencing a significant resurgence of interest based on hybrid working environments that combine point and CAD models. Companies are able to work with point clouds and perform certain operations, such as path-planning, but they lack the support for fast shortest-distance computations for point clouds with more than tens of millions of po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on image processing

سال: 2021

ISSN: ['1057-7149', '1941-0042']

DOI: https://doi.org/10.1109/tip.2021.3104174